On the impossibility of non-static quantum bit commitment between two parties

نویسندگان

  • Qin Li
  • Chengqing Li
  • Dongyang Long
  • Wai Hong Chan
  • Chun-Hui Wu
چکیده

Recently, Choi et al. proposed an assumption on Mayers-Lo-Chau (MLC) no-go theorem that 8 the state of the entire quantum system is invariable to both participants before the unveiling phase. 9 This means that the theorem is only applicable to static quantum bit commitment (QBC). This 10 paper find that the assumption is unnecessary and the MLC no-go theorem can be applied to not 11 only static QBC, but also non-static one. A non-static QBC protocol proposed by Choi et al. is 12 briefly reviewed and analyzed to work as a supporting example. In addition, a novel way to prove 13 the impossibility of the two kinds of QBC is given. 14

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Unconditional Security in Quantum Bit Commitment

The commitment of bits between two mutually distrustful parties is a powerful cryptographic primitive with which many cryptographic objectives can be achieved. It is widely believed that unconditionally secure quantum bit commitment is impossible due to quantum entanglement cheating, which is codified in a general impossibility theorem. Gaps in the proof of this impossibility theorem are found....

متن کامل

How Unconditionally Secure Quantum Bit Commitment Is Possible

Bit commitment involves the submission of evidence from one party to another so that the evidence can be used to confirm a later revealed bit value by the first party, while the second party cannot determine the bit value from the evidence alone. It is widely believed that unconditionally secure quantum bit commitment is impossible due to quantum entanglement cheating, which is codified in a ge...

متن کامل

Security bound of cheat sensitive quantum bit commitment

Cheat sensitive quantum bit commitment (CSQBC) loosens the security requirement of quantum bit commitment (QBC), so that the existing impossibility proofs of unconditionally secure QBC can be evaded. But here we analyze the common features in all existing CSQBC protocols, and show that in any CSQBC having these features, the receiver can always learn a non-trivial amount of information on the s...

متن کامل

Characterizing Quantum Theory in terms of Information-Theoretic Constraints

We show that three fundamental information-theoretic constraints—the impossibility of superluminal information transfer between two physical systems by performing measurements on one of them, the impossibility of broadcasting the information contained in an unknown physical state, and the impossibility of unconditionally secure bit commitment—suffice to entail that the observables and state spa...

متن کامل

Making An Empty Promise With A Quantum Computer (Or, A Brief Review on the Impossibility of Quantum Bit Commitment)

The desire to obtain an unconditionally secure bit commitment protocol in quantum cryptography was expressed for the rst time thirteen years ago. Bit commitment is suucient in quantum cryptography to realize a variety of applications with unconditional security. In 1993, a quantum bit commitment protocol was proposed together with a security proof. However, a basic aw in the protocol was discov...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Quantum Information Processing

دوره 11  شماره 

صفحات  -

تاریخ انتشار 2012